给定度序列图的覆盖成本和反向覆盖成本的研究

具有n个顶点且度序列为(m,2,…,2,1,…,1)(1的重数为m)的连通图不止一个(这些图均为树),而每个树对应唯一一个段序列(l₁,l₂,…,l_m).通过对任意一树移动最长段的悬挂点到最短段悬挂点的方式得到另一树,比较前后两树的覆盖成本和反向覆盖成本,给出了具有最小覆盖成本和反向覆盖成本的极树,并且进一步给出了取得最小覆盖成本和反向覆盖成本的顶点.     

Hermite‐Hadamard‐type inequalities for interval‐valued coordinated convex functions involving generalized fractional integrals

In this paper, we define interval‐valued left‐sided and right‐sided generalized fractional double integrals. We establish inequalities of Hermite‐Hadamard like for coordinated interval‐valued convex functions by applying our newly defined integrals.     

汽配件颜色喷涂顺序问题的TSP转化与建模

汽配件颜色喷涂顺序问题通常以生产线上相邻汽配件颜色切换次数少为最优目标,以进一步降低生产成本.该类问题具有所有汽配件都必须喷涂一次且只喷涂一次的特点,为此提出了TSP转化与建模的方法.将待喷涂汽配件定义为TSP顶点,任意两个待喷涂汽配件的颜色切换定义为顶点的距离,仿照TSP问题构建0-1规划模型;类似于顶点距离,将某些汽配件的颜色或类别不相邻要求定义为0-1矩阵,巧妙地构造了喷涂生产的约束条件.该建模方法简单快速,通用性高,适用于具有类似特点的各类生产实践问题.     

Generalized Jacobi spectral Galerkin method for fractional pantograph differential equation

This work is concerned with the extension of the Jacobi spectral Galerkin method to a class of nonlinear fractional pantograph differential equations. First, the fractional differential equation is converted to a nonlinear Volterra integral equation with weakly singular kernel. Second, we analyze the existence and uniqueness of solutions for the obtained integral equation. Then, the Galerkin method is used for solving the equivalent integral equation. The error estimates for the proposed method are also investigated. Finally, illustrative examples are presented to confirm our theoretical analysis.     

Construction of long MDS self-dual codes from short codes

In this paper, we propose a mechanism on how to construct long MDS self-dual codes from short ones. These codes are special types of generalized Reed-Solomon (GRS) codes or extended generalized Reed-Solomon codes. The main tool is utilizing additive structure or multiplicative structure on finite fields. By applying this method, more MDS self-dual codes can be constructed.     

Advantage of Quantum Theory over Nonclassical Models of Communication

Quantum correlations provide dramatic advantage over the corresponding classical resources in several communication tasks. However, a broad class of probabilistic theories exists that attributes greater success than quantum theory in many of these tasks by allowing supra-quantum correlations in “space-like” and/or “time-like” paradigms. In this letter, a communication task involving three spatially separated parties is proposed where one party (verifier) aims to verify whether the bit strings possessed by the other two parties (terminals) are equal or not. This task is called authentication with limited communication, the restrictions on communication being: i) the terminals cannot communicate with each other, but (ii) each of them can communicate with the verifier through single use of channels with limited capacity. Manifestly, classical resources are not sufficient for perfect success of this task. Moreover, it is also not possible to perform this task with certainty in several nonclassical theories although they might possess stronger “space-like” and/or “time-like” correlations. Surprisingly, quantum resources can achieve the perfect winning strategy. The proposed task thus stands apart from all previously known communication tasks as it exhibits quantum advantage over other nonclassical strategies.